Model checking using net unfoldings

Model Checking with Net Unfoldings ?

We report on an implementation of the unfolding approach to model-checking LTL-X presented in [3]. Contrary to [3], we consider an state-based version of LTL-X, which is more used in practice. We improve on the checking algorithm; the new version allows to reuse code much more e ciently. We present results on a set of case studies.

Deadlock Checking Using Net Unfoldings

McMillan presented a deadlock detection technique based on unfoldings of Petri net systems. It is realized by means of a backtracking algorithm that has its drawback for unfoldings that increase widely. We present an approach that exploits precisely this property. Moreover, we introduce a fast implementation of McMillan's algorithm and compare it with our new technique.

Model Checking LTL with Fairness Assumptions using Net Unfoldings

We investigate the model checking problem for a class of petri nets using net unfoldings. Net unfoldings are a well studied partial order semantics for petri nets and are well-suited for modeling concurrent and distributed systems. We consider the problem of model checking LTL-X (LTL without the next time operator) with fairness assumptions for the class of one-safe petri nets. Recently, in [1]...

Model Checking Based on Prefixes of Petri Net Unfoldings

v

Reachability Analysis Using Net Unfoldings